package leetCode;

/**
 * 162. 寻找峰值
 * https://leetcode.cn/problems/find-peak-element/description/
 */
class Solution2 {
    public int findPeakElement(int[] nums) {
        int left = 0, right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left) /2;
            if(nums[mid] > nums[mid + 1]) right = mid;
            else left = mid + 1; 
        }
        return left;
    }
}